Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Multi-universe parallel quantum-inspired evolutionary algorithm based on adaptive mechanism
LIU Xiaohong, QU Zhijian, CAO Yanfeng, ZHANG Xianwei, FENG Gang
Journal of Computer Applications    2015, 35 (2): 369-373.   DOI: 10.11772/j.issn.1001-9081.2015.02.0369
Abstract569)      PDF (738KB)(434)       Save

The way of selecting evolutionary parameters is vital for the optimal performance of the Quantum-inspired Evolutionary Algorithm (QEA). However, in conventional QEA, all individuals employ the same evolutionary parameters to complete update without considering the individual difference of the population, thus the drawbacks including slow convergence speed and being easy to fall into local optimal solution are exposed in computing combination optimization problem. To address those problems, an adaptive evolutionary mechanism was employed to adjust the rotation angle step and the quantum mutation probability in the quantum evolutionary algorithm. In the algorithm, the evolutionary parameters in each individual and each evolution generation were determined by the individual fitness to ensure that as many evolutionary individuals as possible could evolve to the optimal solution direction. In addition, the adaptive-evolution-based evolutionary algorithm needs to evaluate the fitness of each individual, which leads to a longer operation time. To solve this problem, the proposed adaptive quantum-inspired evolutionary algorithm was parallel implemented in different universe to improve the execution efficiency. The proposed algorithms were tested by searching the optimal solutions of three multimodal functions and solving knapsack problem. The experimental results show that, compared with conventional QEA, the proposed algorithms can achieve better performances in convergence speed and searching the global optimal solution.

Reference | Related Articles | Metrics
Digital watermarking algorithm using Discrete Wavelet Transform
YANG Xiong, FENG Gang, YAN Xiong-bing, LIU Xiong-hua
Journal of Computer Applications    2005, 25 (03): 565-566.   DOI: 10.3724/SP.J.1087.2005.0565
Abstract1514)      PDF (97KB)(966)       Save
Though many DWT-based watermarking algorithms have been presented, few of them discuss the issue that which detail subband is the better choice to watermark. This paper presented a novel DWT-based watermarking algorithm. This algorithm selected the detail subband with the highest RMS value for watermarking and got good results. Experiment results show that watermarking in this subband is more robust than the other two detail subbands to Gaussian noise and JPEG compression.
Related Articles | Metrics